Algorithmic computation of steady-state probabilities in an almost observable GI/M/c queue with or without vacations under state dependent balking and reneging

Balking Strategies in an Observable Queue with Vacations ⋆

This paper compares the equilibrium threshold strategies of customers with different decision criteria in an observable queue with multiple vacations. Customers are not informed of the service time distribution and the state of the server, whereas they are told that the expected service time is an alternative of two values or the variable service time belongs to an interval. We find that both t...

Analysis of an M/M/1/N Queue with Balking, Reneging and Server Vacations

This paper presents an analysis for an M/M/1/N queueing system with balking, reneging and server vacations. Arriving customers balk (do not enter) with a probability and renege (leave the queue after entering) according to a negative exponential distribution. It is assumed that the server has a multiple vacation. By using the Markov process method, we first develop the equations of the steady s...

Analysis of Finite Buffer Markovian Queue with Balking, Reneging and Working Vacations

This article presents the analysis of a finite buffer M/M/1 queue with multiple and single working vacations. The arriving customers balk (that is do not join the queue) with a probability and renege (that is leave the queue after joining) according to exponential distribution. The inter-arrival times, service times during a regular service period, service times during a vacation period and vac...

M m m Queue with Balking, Reneging and Additional Servers

In this paper, we consider a multi-server queuing system in which additional servers are allowed for a longer queue to reduce the customer’s balking and reneging behavior. The customers are assumed to arrive in Poisson fashion and their service- times follow exponential distribution. The number of servers in long run depends on the queue-length. We obtain equilibrium queue size distribution. Th...

Steady State Probabilities of a Three Preemptive Single Server Queue